Revisiting Horn and Schunck: Interpretation as Gauss-Newton Optimisation

نویسندگان

  • Darko Zikic
  • Ali Kamen
  • Nassir Navab
چکیده

In this paper we revisit the Horn and Schunck optical flow method [1], and focus on its interpretation as Gauss-Newton optimisation. We explicitly demonstrate that the standard incremental version of the Horn and Schunck (HS) method1 is equivalent to Gauss-Newton (GN) optimisation of the non-linearised energy, consisting of the sum of squared differences (SSD) criterion and diffusion regularisation. The formulation of incremental Horn and Schunck as Gauss-Newton optimisation has the following advantages. • The proposed interpretation reveals that the incremental HS minimises a non-linearised energy. This affects one of the major points of criticism, which is that HS is applicable only for small displacements, since it minimises a linearised energy. This common misapprehension is presumably caused since many works based on HS do not state explicitly the overall energy, but only the linearised approximations of the energy, which are used in every iteration. • Much simpler formulation and derivation of the HS method become possible please compare Figs. 1 and 2. • Embedding the formulation in the well-understood non-linear leastsquares (NLSQ) optimisation framework provides insight into the behaviour of the method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revisiting Horn and Schunck: Interpretation as Gauß-Newton Optimisation

We revisit the classic Horn and Schunck optical flow method, with focus on its interpretation as a Gauss-Newton (GN) minimisation of a non-linear energy. This is in contrast to the traditional derivation by linearisation of the brightness constancy assumption. The proposed interpretation provides a much simpler derivation and a better theoretical understanding of the method, and allows for its ...

متن کامل

A Variational Multigrid for Computing the Optical Flow

Computing the optical flow for a sequence of images is currently a standard low-level problem in machine vision. A classical way to solve this problem is the Horn-Schunck algorithm. It corresponds to a coupled Gauss-Seidel relaxation for solving a system of two PDEs. The convergence of the algorithm is in general poor. A multigrid strategy can be expected to provide a significant acceleration. ...

متن کامل

Diffeomorphic registration using geodesic shooting and Gauss–Newton optimisation

This paper presents a nonlinear image registration algorithm based on the setting of Large Deformation Diffeomorphic Metric Mapping (LDDMM), but with a more efficient optimisation scheme--both in terms of memory required and the number of iterations required to reach convergence. Rather than perform a variational optimisation on a series of velocity fields, the algorithm is formulated to use a ...

متن کامل

Practical Gauss-Newton Optimisation for Deep Learning

We present an efficient block-diagonal approximation to the Gauss-Newton matrix for feedforward neural networks. Our resulting algorithm is competitive against state-of-the-art first-order optimisation methods, with sometimes significant improvement in optimisation performance. Unlike first-order methods, for which hyperparameter tuning of the optimisation parameters is often a laborious proces...

متن کامل

A Study on Robustness of Various Deformable Image Registration Algorithms on Image Reconstruction Using 4DCT Thoracic Images

Background: Medical image interpolation is recently introduced as a helpful tool to obtain further information via initial available images taken by tomography systems. To do this, deformable image registration algorithms are mainly utilized to perform image interpolation using tomography images.Materials and Methods: In this work, 4DCT thoracic images of five real patients provided by DI...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010